Constraint Reduction Reformulations for Projection Algorithms with Applications to Wavelet Construction
نویسندگان
چکیده
We introduce a reformulation technique that converts many-set feasibility problem into an equivalent two-set problem. This involves reformulating the original by replacing pair of its constraint sets with their intersection, before applying Pierra’s classical product space reformulation. The step combining two reduces dimension spaces. refer to this as reduction and use it obtain constraint-reduced variants well-known projection algorithms such Douglas–Rachford algorithm method alternating projections, among others. prove global convergence in presence convexity local nonconvex setting. In order analyze method, we generalize result which guarantees composition projectors onto subspaces is projector intersection. Finally, apply versions projections solve wavelet problems then compare performance usual variants.
منابع مشابه
Iterative Projection Algorithms with a Binary Constraint
Iterative projection algorithms can be an effective method for solving image reconstruction problems with limited data by incorporating a priori information (constraints) on the image. However, these algorithms may experience convergence difficulties if the constraints are non-convex. Iterative projection algorithms are evaluated for the molecular envelope problem in x-ray crystallography where...
متن کاملOptimization without Minimization Search: Constraint Satisfaction by Orthogonal Projection with Applications to Multiview Triangulation
We present an alternative approach to what we call the “standard optimization”, which minimizes a cost function by searching a parameter space. Instead, our approach “projects” in the joint observation space onto the manifold defined by the “consistency constraint”, which demands that any minimal subset of observations produce the same result. This approach avoids many difficulties encountered ...
متن کاملNew algorithms on wavelet trees and applications to information retrieval
Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, however, that this still falls short of exploiting all of the virtues of this versatile data structure. In particular we show how to use wavelet trees to solve fundamental algorithmic problems such as range quantile que...
متن کاملProjection algorithms with correction
We present in this paper two versions of a general correction procedure applied to a classical iterative method, which gives us the possibility, under certain assumptions, to obtain an extension of it to inconsistent linear least-squares problems. We prove that some well known extended projection type algorithms from image reconstruction in computerized tomography fit into one or the other of t...
متن کاملApproximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
A feedback vertex set of an undirected graph is a subset of vertices that intersects with the vertex set of each cycle in the graph. Given an undirected graph G with n vertices and weights on its vertices, polynomial-time algorithms are provided for approximating the problem of finding a feedback vertex set of G with smallest weight. When the weights of all vertices in G are equal, the performa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2021
ISSN: ['0022-3239', '1573-2878']
DOI: https://doi.org/10.1007/s10957-021-01878-z